Given an array of integers nums, sort the array in increasing order based on the frequency of the values. If multiple values have the same frequency, sort them in decreasing order.
Return the sorted array.
Input: nums = [1,1,2,2,2,3] Output: [3,1,1,2,2,2] Explanation: '3' has a frequency of 1, '1' has a frequency of 2, and '2' has a frequency of 3.
Input: nums = [2,3,1,3,2] Output: [1,3,3,2,2] Explanation: '2' and '3' both have a frequency of 2, so they are sorted in decreasing order.
Input: nums = [-1,1,-6,4,5,-6,1,4,1] Output: [5,-1,4,4,-6,-6,1,1,1]
1 <= nums.length <= 100-100 <= nums[i] <= 100
use std::collections::HashMap;implSolution{pubfnfrequency_sort(mutnums:Vec<i32>) -> Vec<i32>{letmut count = HashMap::new();for&num in&nums {*count.entry(num).or_insert(0) += 1;} nums.sort_unstable_by(|a, b| b.cmp(a)); nums.sort_by_key(|k| count.get(k).unwrap()); nums }}